Differential Privacy via Weighted Sampling Set Cover

نویسندگان

  • Zhonglian Hu
  • Zhaobin Liu
  • Yangyang Xu
  • Zhiyang Li
چکیده

Differential privacy is a security guarantee model which widely used in privacy preserving data publishing, but the query result can’t be used in data research directly, especially in high-dimensional datasets. To address this problem, we propose a dimensionality reduction method. The core idea of this method is using a series of lowdimensional datasets to reconstruct a high-dimensional dataset, it improves data availability eventually. The main issue of this method is the reconstruction integrity, so a special sampling via set cover model is proposed in this article, which builds a multidimensional composite marginal tables set as a new middleware in differential privacy model. As a result, any form of disjunctive queries can be answered, and the accuracy of data query is improved. The experiment results also show the effectiveness of our method in practice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling

The minimum-weight set cover problem is widely known to be O(log n)-approximable, with no improvement possible in the general case. We take the approach of exploiting problem structure to achieve better results, by providing a geometry-inspired algorithm whose approximation guarantee depends solely on an instance-specific combinatorial property known as shallow cell complexity (SCC). Roughly sp...

متن کامل

How to Squeeze a Crowd: Reducing Bandwidth in Mixing Cryptocurrencies

Several popular cryptocurrencies incorporate privacy features that “mix” real transactions with cover traffic in order to obfuscate the public transaction graph. The underlying protocols, which include CryptoNote and Monero’s RingCT, work by first identifying a real transaction output (TXO), sampling a number of cover outputs, and transmitting the entire resulting set to verifiers, along with a...

متن کامل

7.8.2 Differential Privacy 17.8.2.1 Intuitive Definition

These are all well known combinatorial optimization problems: respectively the minimum cut problem, the k-median problem, and the set cover problem. The minimum cut problem has a polynomial time algorithm, the k-median problem has a constant factor approximation algorithm, and the set cover problem has a logarithmic approximation algorithm. Although many would consider these problems well-studi...

متن کامل

Practical Differential Privacy via Grouping and Smoothing

We address one-time publishing of non-overlapping counts with ǫ-differential privacy. These statistics are useful in a wide and important range of applications, including transactional, traffic and medical data analysis. Prior work on the topic publishes such statistics with prohibitively low utility in several practical scenarios. Towards this end, we present GS, a method that pre-processes th...

متن کامل

Weighted Geometric Set Multi-cover via Quasi-uniform Sampling

We give a randomized polynomial time algorithm with approximation ratio O(log φ(n)) for weighted set multi-cover instances with a shallow cell complexity of at most f(n, k) = nφ(n)k. Up to constant factors, this matches a recent result of Könemann et al. for the set cover case, i.e. when all the covering requirements are 1. One consequence of this is an O(1)-approximation for geometric weighted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016